863A - Quasi-palindrome - CodeForces Solution


brute force implementation *900

Please click on ads to support us..

Python Code:

try  :
    n = int(input())
    a =str(n)
    b = a[::-1]
    count = 0 
    while n % 10 == 0 :
        if n % 10 == 0 :
            count +=1 
            n = n // 10
    if count == 0 :
        if int(b) == n :
            print('Yes')
        else : 
            print('No')
    else :
        b = b + str(count*'0')
        if int(b) == int(a) :
            print('Yes')
        else :
            print('No')
except :
    print('Please enter the correct data type.')

C++ Code:

#include <bits/stdc++.h>

using namespace std;

int main() {
  int n;
  cin >> n;
  string s = to_string(n);
  for (int i = s.size()-1; true ; --i) {
    if(s[i] == '0')
      s.pop_back();
    else               break;
  }
  string rev = s;
  reverse(rev.begin(),rev.end());
  if (rev == s)   cout << "YES";
  else            cout << "NO";
  return 0;
}


Comments

Submit
0 Comments
More Questions

1006A - Adjacent Replacements
1195C - Basketball Exercise
1206A - Choose Two Numbers
1438B - Valerii Against Everyone
822A - I'm bored with life
9A - Die Roll
1430B - Barrels
279B - Books
1374B - Multiply by 2 divide by 6
1093B - Letters Rearranging
1213C - Book Reading
1468C - Berpizza
1546B - AquaMoon and Stolen String
1353C - Board Moves
902A - Visiting a Friend
299B - Ksusha the Squirrel
1647D - Madoka and the Best School in Russia
1208A - XORinacci
1539B - Love Song
22B - Bargaining Table
1490B - Balanced Remainders
264A - Escape from Stones
1506A - Strange Table
456A - Laptops
855B - Marvolo Gaunt's Ring
1454A - Special Permutation
1359A - Berland Poker
459A - Pashmak and Garden
1327B - Princesses and Princes
1450F - The Struggling Contestant